Heuristic Faculty Course Timetabling with Student Sectioning

نویسندگان

  • Chia-Lih Bong
  • San-Nah Sze
  • Noor Alamshah Bolhassan
  • Kang-Leng Chiew
چکیده

This paper studies a real faculty course timetabling problem of Faculty of Computer Science and Information Technology (FCSIT), Universiti Malaysia Sarawak (UNIMAS). FCSIT offers 5 four-year programmes. Each programme has own set of courses but some courses are required by more than one programme. List of courses for each semester of all programmes are planned and suggested by faculty as in course plan but students are free to select their own course registration. FCSIT has to come out with course timetable with no clashes before semester starts. Current curriculum-based timetabling method causes clashes and requires few rounds of adjustment. The aim of this study is to come out with better method than the current curriculum-based timetabling practice. A two-stage heuristic with student sectioning consideration method is proposed to solve the problem by student-based approach. A simulator is developed and tested with real datasets from FCSIT. It generates clash-free timetables in shorter time as adjustment is unnecessary. Results shown that simulator solution performs better in utilise venue resources by reduced 13.1% unnecessary allocation. On top of that, the simulator is proved to be efficient in solving problem for different semesters with changed problem size, different offering courses and different resources given.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the routing problem for course timetabling: A case study in a Tunisian university

In this paper we present a solution for the routing problem related to university course timetabling. We propose a heuristic algorithm that reduces the total distance travelled by each group of student between the different buildings occupying classrooms. This heuristic was tested using real data from the faculty of economic and management sciences of Sfax in Tunisia. The obtained results have ...

متن کامل

System Demonstration of Interactive Course Timetabling

This system demonstration presents an approach to interactive timetabling used by the UniTime university timetabling system. This application, which is publicly available under an open source license, has been successfully applied at Purdue University [8], a large public university (39,000 students) with a broad spectrum of programs at the undergraduate and graduate levels. The complete system ...

متن کامل

Comprehensive approach to student sectioning

Student sectioning is the problem of assigning students to particular sections of courses they request while respecting constraints such as course structures, section limits, and reserved spaces. Students may also provide preferences on class times and course alternatives. In this paper, three approaches to this problem are examined and combined in order to tackle it on a practical level: stude...

متن کامل

Course Timetabling at a Tunisian University: a Case Study

This paper deals with the Course Timetabling Problem at an institution in a Tunisian University. We introduce a heuristic procedure to construct a feasible timetable for all lectures and tutorials taken by different groups of each sub-section of any section. We describe the timetabling problem using a list of all specific hard and soft constraints. We formulate the problem as a set of linear co...

متن کامل

A Simulated Annealing Hyper-heuristic for University Course Timetabling

The university course timetabling problem involves assigning a given number of events (including lectures, seminars, labs, tutorials, etc) into a limited number of timeslots and rooms subject to given set of constraints. Two primary hard constraints are that no student should be assigned two events in one timeslot and that capacity and features of rooms should satisfy the requirement of the eve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017